Augmented Markov Chain Monte Carlo Simulation for Two-Stage Stochastic Programs with Recourse

نویسندگان

  • Tahir Ekin
  • Nicholas G. Polson
  • Refik Soyer
چکیده

In this paper, we develop a simulation-based approach for two-stage stochastic programs with recourse. We construct an augmented probability model with stochastic shocks and decision variables. Simulating from the augmented probability model solves for the expected recourse function and the optimal first-stage decision. Markov chain Monte Carlo methods, together with ergodic averaging, provide a framework to compute the optimal solution. We illustrate our methodology via the two-stage newsvendor problem with unimodal and bimodal continuous uncertainty. Finally, we present performance comparisons of our algorithm and the sample average approximation method. About the Speaker Nicholas Polson is a Bayesian statistician who conducts research on Financial Econometrics, Markov chain Monte Carlo, Particle learning, and Bayesian inference. Inspired by an interest in probability, Polson has developed a number of new algorithms and applied them to the fields of statistics and financial econometrics, including the Bayesian analysis of stochastic volatility models and sequential particle learning for statistical inference. Polson’s article, “Bayesian Analysis of Stochastic Volatility Models,” was named one of the most influential articles in the 20th anniversary issue of the Journal of Business and Economic Statistics. His recent work includes methods for sparse Bayesian estimation with application to high dimensional regression and classification. Enquiry: 3442 8408 All are Welcome! SEEM Seminar 2014-2015/028

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Numerical Method for Two-Stage Stochastic Programs under Uncertainty

Motivated by problems coming from planning and operational management in power generation companies, this work extends the traditional two-stage linear stochastic program by adding probabilistic constraints in the second stage. In this work we describe, under special assumptions, how the two-stage stochastic programs with mixed probabilities can be treated computationally. We obtain a convex co...

متن کامل

Importance Sampling in Stochastic Programming: A Markov Chain Monte Carlo Approach

Stochastic programming models are large-scale optimization problems that are used to facilitate decisionmaking under uncertainty. Optimization algorithms for such problems need to evaluate the expected future costs of current decisions, often referred to as the recourse function. In practice, this calculation is computationally difficult as it requires the evaluation of a multidimensional integ...

متن کامل

The Markov Chain Monte Carlo Approach to Importance Sampling in Stochastic Programming

Stochastic programming models are large-scale optimization problems that are used to facilitate decision-making under uncertainty. Optimization algorithms for such problems need to evaluate the expected future costs of current decisions, often referred to as the recourse function. In practice, this calculation is computationally difficult as it involves the evaluation of a multidimensional inte...

متن کامل

A Stochastic algorithm to solve multiple dimensional Fredholm integral equations of the second kind

In the present work‎, ‎a new stochastic algorithm is proposed to solve multiple dimensional Fredholm integral equations of the second kind‎. ‎The solution of the‎ integral equation is described by the Neumann series expansion‎. ‎Each term of this expansion can be considered as an expectation which is approximated by a continuous Markov chain Monte Carlo method‎. ‎An algorithm is proposed to sim...

متن کامل

On complexity of stochastic programming problems

The main focus of this paper is in a discussion of complexity of stochastic programming problems. We argue that two-stage (linear) stochastic programming problems with recourse can be solved with a reasonable accuracy by using Monte Carlo sampling techniques, while multi-stage stochastic programs, in general, are intractable. We also discuss complexity of chance constrained problems and multi-s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Decision Analysis

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2014